|
The ''relaxed intersection'' of ''m'' sets corresponds to the classical intersection between sets except that it is allowed to relax few sets in order to avoid an empty intersection. This notion can be used to solve Constraints Satisfaction Problems that are inconsistent by relaxing a small number of constraints. When a bounded-error approach is considered for parameter estimation, the relaxed intersection makes it possible to be robust with respect to some outliers. ==Definition== The ''q''-relaxed intersection of the ''m'' subsets of , denoted by is the set of all which belong to all 's, except at most. This definition is illustrated by Figure 1. Define We have Characterizing the q-relaxed intersection is a thus a set inversion problem. 〔 〕 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「relaxed intersection」の詳細全文を読む スポンサード リンク
|